Buffer Management Problems

نویسندگان

  • Leah Epstein
  • Rob van Stee
چکیده

In recent years, there has been a lot of interest in Quality of Service (QoS) networks. In regular IP networks, packets are indistinguishable and in case of overload any packet may be dropped. In a commercial environment, it is much more preferable to allow better service to higher-paying customers or customers with critical requirements. The idea of Quality of Service guarantees is that packets are marked with values which indicate their importance. This naturally leads to decision problems at network switches when many packets arrive and overload occurs. In this paper, we give an overview of several models that have been studied in this area from an online perspective. These models differ by restrictions such as bounded delay, bounded size of queue etc. We first present results for a single buffer in Section 1 and then for multiple buffers in Section 2. This paper is not meant as a comprehensive survey of the work in this area. There are many more variations of these problems that have been studied, for instance, multiple output buffers [14]. Our goal was merely to give a taste of this problem area, and we hope you enjoy it.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VAR-PAGE-LRU A Buffer Replacement Algorithm Supporting Different Page Sizes

Non-standard applications (such as CAD/CAM etc.) require new concepts and implementation techniques at each layer of an appropriate database management system. The buffer manager, for example, should support either different page sizes, set-oriented operations on pages, or both in order to deal with large objects in an efficient way. However, implementing different page sizes causes some new bu...

متن کامل

An electromagnetism-like metaheuristic for open-shop problems with no buffer

This paper considers open-shop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic base...

متن کامل

An Application of Dbr and Buffer Management in Solving Real World Problems

Any real world system must have at least one constraint to limit the system from achieving its objective. How to make good use of constraints is of vital importance to increase the efficiency of the system. In this paper, an approximate algorithm consisting of two stages of approaches is proposed for solving the real world problems. The first stage of approach called Basic Approach (BA) is prop...

متن کامل

Buffer Management in Cellular IP Network using PSO

Cellular IP networks deal with the concepts of micro-mobility. Buffer management in Cellular IP networks is very crucial as its proper usage not only increases the throughput of the network but also results in the reduction of the call drops. This article proposes a model for buffer management in Cellular IP network using Particle Swarm Optimization (PSO), an evolutionary computational method o...

متن کامل

CALL ADMISSION CONTROL AND RESOURCE UTILIZATION IN ATM NETWORKS: A NEW IMPROVEMENT STRATEGY. - Global Telecommunications Conference, 1994. GLOBECOM '94. 'Communications: The Global Bridge'., IE

Congestion and admission control are two of the most widely investigated problems which must be faced in ATM. The FBR (Fast Buffer Reservation), i.e. a virtual circuit acceptance algorithm proposed by Turner [Tur 921, based on the excess probability criterion (EPC), seems to be a complete approach for bandwidth management. It will constitute the starting point of the new admission and congestio...

متن کامل

Improving for Drum_Buffer_Rope material flow management with attention to second bottlenecks and free goods in a job shop environment

Drum–Buffer–Rope is a theory of constraints production planning methodology that operates by developing a schedule for the system’s first bottleneck. The first bottleneck is the bottleneck with the highest utilization. In the theory of constraints, any job that is not processed at the first bottleneck is referred to as a free good. Free goods do not use capacity at the first bottleneck, so very...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004